Implementation of Channel Hopping Algorithm in Cognitive Radio Network & MANET

نویسنده

  • V. Srinivasa Rao
چکیده

Dynamic spectrum access by the unlicensed secondary users (nodes) in the Cognitive Radio Network without harmful (potential) interference to the licensed users is an intelligent and efficient use of the Licensed Spectrum Bands. The nodes in a cognitive radio network(CRN) performs periodic local spectrum sensing & dynamically detects the vacant or unused spectrum around them in the form of free channels or spectrum holes which are used for communication among cognitive radio(CR) nodes. If any vacant channel is detected by the secondary user or CR node, it is strictly the responsibility of the CR node to vacate the channel upon the return of Primary User (PU) so that the Licensed user doesn‟t get any potential interference from the CR user. This paper presents an algorithm called „Vacate on Demand algorithm‟ which performs two main functions.1) Vacating the channel by CR user in case of PU return or after the completion of every sensing interval.2) Moving the CR user to some other vacant channel. After the completion of periodic spectrum sensing activity by CR nodes, based on the sensing results, a ranking table is formed which contains the total channels arranged from bottom to top in the order of Primary User activity. The algorithm uses this ranking table for quickly vacating the occupied channel by CR user in case of PU return & dynamically searches for vacant channel in the ranking table. This paper also compares the expected time to get a free channel in CRN with that of a MANET (Mobile Ad hoc Network).The performance of the above algorithm is analyzed using MATLAB simulation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Multicast Tree Construction Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks

Many appealing multicast services such as on-demand TV, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. When multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. Designing a good multicast tree to route data packets could enhance the...

متن کامل

Multi-Radio Channel Detecting Jamming Attack Against Enhanced Jump-Stay Based Rendezvous in Cognitive Radio Networks

Rendezvous problem has been attracting much attention as a fundamental process to construct the Cognitive Radio Network (CRN). Many elegant algorithms have been proposed to achieve rendezvous on some common channel in a short time, but they are vulnerable to the jamming attacks where a jammer may exist listening or blocking the channels [13]. In this paper, we propose the Multi-Radio Channel De...

متن کامل

A Hybrid MAC Protocol for Cognitive Radio Ad Hoc Networks

In cognitive radio networks, secondary users exchange control information to utilize the available channels efficiently, to maintain connectivity, to negotiate for data communication such as sender-receiver handshakes, for neighbor discovery etc. This task is not trivial in cognitive radio networks due to the dynamic nature of network environment. Generally, this problem is tackled by using two...

متن کامل

The Life Cycle of the Rendezvous Problem of Cognitive Radio Ad Hoc Networks: A Survey

In cognitive radio or dynamic spectrum access networks, a rendezvous represents meeting two or more users on a common channel, and negotiating to establish data communication. The rendezvous problem is one of the most challenging tasks in cognitive radio ad hoc networks. Generally, this problem is simplified by using two well-known mechanisms: the first uses a predefined common control channel,...

متن کامل

Interference-Aware and Cluster Based Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks

Multicast routing is one of the most important services in Multi Radio Multi Channel (MRMC) Wireless Mesh Networks (WMN). Multicast routing performance in WMNs could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. In this paper we want to address the multicast routing problem for a given channel assignment in WMNs. The channels...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015